var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\",\"authorFirst\":\"1\",\"nocache\":\"1\",\"fullnames\":\"1\",\"theme\":\"bullets\",\"group0\":\"year\",\"group1\":\"type\",\"owner\":\"{}\",\"filter\":\"label:(td_j08|tcd_j08|td_j07)\",\"jsonp\":\"1\",\"host\":\"bibbase.org\"},\n      data: [{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We study the multi-user successive refinement problem (posed in Pradhan and Ramchandran, 2002), where the users are connected to a central server through links with different noiseless capacities. Each user requires to reconstruct the source in a scalable manner. We provide the best known achievable strategy for the two-user, two-layer case and the complete characterization of the rate-distortion region for the Gaussian source under the mean-squared error (MSE) distortion measure.\",\"author\":[{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Chen\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"S\",\"N.\",\"Diggavi\"],\"firstnames\":[\"\"],\"suffixes\":[]}],\"file\":\":papers:multiusersr.pdf\",\"journal\":\"IEEE Transactions on Information Theory\",\"label\":\"tcd_j08\",\"month\":\"February\",\"note\":\"\",\"number\":\"2\",\"pages\":\"921–931\",\"tags\":\"journal,RDSI,NDC,RDmultiserSucRef,IT,MDC\",\"title\":\"Multiuser successive refinement and multiple description coding\",\"url_arxiv\":\"http://arxiv.org/abs/0707.4133\",\"volume\":\"54\",\"year\":\"2008\",\"bibtex\":\"@article{TCDj08,\\n abstract = {We study the multi-user successive refinement problem (posed in Pradhan and Ramchandran, 2002), where the users are connected to a central server through links with different noiseless capacities. Each user requires to reconstruct the source in a scalable manner. We provide the best known achievable strategy for the two-user, two-layer case and the complete characterization of the rate-distortion region for the Gaussian source under the mean-squared error (MSE) distortion measure.},\\n author = {C. Tian and J. Chen and S N. Diggavi,},\\n file = {:papers:multiusersr.pdf},\\n journal = {IEEE Transactions on Information Theory},\\n label = {tcd_j08},\\n month = {February},\\n note = {},\\n number = {2},\\n pages = {921--931},\\n tags = {journal,RDSI,NDC,RDmultiserSucRef,IT,MDC},\\n title = {Multiuser successive refinement and multiple description coding},\\n type = {2},\\n url_arxiv = {http://arxiv.org/abs/0707.4133},\\n volume = {54},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Tian, C.\",\"Chen, J.\",\"S N. Diggavi, undefined\"],\"key\":\"TCDj08\",\"id\":\"TCDj08\",\"bibbaseid\":\"tian-chen-sndiggavi-multiusersuccessiverefinementandmultipledescriptioncoding-2008\",\"role\":\"author\",\"urls\":{\" arxiv\":\"http://arxiv.org/abs/0707.4133\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"We introduce the problem of side-information scalable data compression In this problem, the encoder constructs a progressive description, such that the receiver with high quality side information will be able to truncate the bit-stream and reconstruct in the rate distortion sense, while the receiver with low quality side information will have to receive further data in order to decode. We provide a complete characterization of the rate distortion region for the important quadratic Gaussian case with multiple jointly Gaussian side-informations, where the side information quality does not have to be monotonic along the scalable coding order. Inner and outer bounds are provided to the rate distortion region for general discrete memoryless sources.\",\"author\":[{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Tian\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"file\":\":papers:siscalable_tiandiggavi.pdf\",\"journal\":\"IEEE Transactions on Information Theory\",\"label\":\"td_j08\",\"month\":\"December\",\"note\":\"\",\"number\":\"12\",\"pages\":\"5591–5608\",\"tags\":\"journal,RDSI,NDC,ScalableSIcod,IT\",\"title\":\"Side-information scalable source coding\",\"url_arxiv\":\"http://arxiv.org/abs/0707.4597\",\"volume\":\"54\",\"year\":\"2008\",\"bibtex\":\"@article{TDj08,\\n abstract = {We introduce the problem of side-information scalable data compression\\nIn this problem, the encoder constructs a progressive description, such that the receiver with high quality side information will be able to truncate the bit-stream and reconstruct in the rate distortion sense, while the receiver with low quality\\nside information will have to receive further data in order to decode. We provide a complete characterization of the\\nrate distortion region for the important quadratic Gaussian case with multiple jointly Gaussian side-informations,\\nwhere the side information quality does not have to be monotonic along the scalable coding order. Inner and outer bounds are provided to\\nthe rate distortion region for general discrete memoryless sources.},\\n author = {C. Tian and S N. Diggavi},\\n file = {:papers:siscalable_tiandiggavi.pdf},\\n journal = {IEEE Transactions on Information Theory},\\n label = {td_j08},\\n month = {December},\\n note = {},\\n number = {12},\\n pages = {5591--5608},\\n tags = {journal,RDSI,NDC,ScalableSIcod,IT},\\n title = {Side-information scalable source coding},\\n type = {2},\\n url_arxiv = {http://arxiv.org/abs/0707.4597},\\n volume = {54},\\n year = {2008}\\n}\\n\\n\",\"author_short\":[\"Tian, C.\",\"Diggavi, S N.\"],\"key\":\"TDj08\",\"id\":\"TDj08\",\"bibbaseid\":\"tian-diggavi-sideinformationscalablesourcecoding-2008\",\"role\":\"author\",\"urls\":{\" arxiv\":\"http://arxiv.org/abs/0707.4597\"},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"}],\n      metadata: {\"authorlinks\":{}},\n      ownerID: undefined\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"publicactions_v1.bib\" href=\"data:text/bibtex;base64,QGFydGljbGV7VENEajA4LAogYWJzdHJhY3QgPSB7V2Ugc3R1ZHkgdGhlIG11bHRpLXVzZXIgc3VjY2Vzc2l2ZSByZWZpbmVtZW50IHByb2JsZW0gKHBvc2VkIGluIFByYWRoYW4gYW5kIFJhbWNoYW5kcmFuLCAyMDAyKSwgd2hlcmUgdGhlIHVzZXJzIGFyZSBjb25uZWN0ZWQgdG8gYSBjZW50cmFsIHNlcnZlciB0aHJvdWdoIGxpbmtzIHdpdGggZGlmZmVyZW50IG5vaXNlbGVzcyBjYXBhY2l0aWVzLiBFYWNoIHVzZXIgcmVxdWlyZXMgdG8gcmVjb25zdHJ1Y3QgdGhlIHNvdXJjZSBpbiBhIHNjYWxhYmxlIG1hbm5lci4gV2UgcHJvdmlkZSB0aGUgYmVzdCBrbm93biBhY2hpZXZhYmxlIHN0cmF0ZWd5IGZvciB0aGUgdHdvLXVzZXIsIHR3by1sYXllciBjYXNlIGFuZCB0aGUgY29tcGxldGUgY2hhcmFjdGVyaXphdGlvbiBvZiB0aGUgcmF0ZS1kaXN0b3J0aW9uIHJlZ2lvbiBmb3IgdGhlIEdhdXNzaWFuIHNvdXJjZSB1bmRlciB0aGUgbWVhbi1zcXVhcmVkIGVycm9yIChNU0UpIGRpc3RvcnRpb24gbWVhc3VyZS59LAogYXV0aG9yID0ge0MuIFRpYW4gYW5kIEouIENoZW4gYW5kIFMgTi4gRGlnZ2F2aSx9LAogZmlsZSA9IHs6cGFwZXJzOm11bHRpdXNlcnNyLnBkZn0sCiBqb3VybmFsID0ge0lFRUUgVHJhbnNhY3Rpb25zIG9uIEluZm9ybWF0aW9uIFRoZW9yeX0sCiBsYWJlbCA9IHt0Y2RfajA4fSwKIG1vbnRoID0ge0ZlYnJ1YXJ5fSwKIG5vdGUgPSB7fSwKIG51bWJlciA9IHsyfSwKIHBhZ2VzID0gezkyMS0tOTMxfSwKIHRhZ3MgPSB7am91cm5hbCxSRFNJLE5EQyxSRG11bHRpc2VyU3VjUmVmLElULE1EQ30sCiB0aXRsZSA9IHtNdWx0aXVzZXIgc3VjY2Vzc2l2ZSByZWZpbmVtZW50IGFuZCBtdWx0aXBsZSBkZXNjcmlwdGlvbiBjb2Rpbmd9LAogdHlwZSA9IHsyfSwKIHVybF9hcnhpdiA9IHtodHRwOi8vYXJ4aXYub3JnL2Ficy8wNzA3LjQxMzN9LAogdm9sdW1lID0gezU0fSwKIHllYXIgPSB7MjAwOH0KfQoKCgpAYXJ0aWNsZXtURGowOCwKIGFic3RyYWN0ID0ge1dlIGludHJvZHVjZSB0aGUgcHJvYmxlbSBvZiBzaWRlLWluZm9ybWF0aW9uIHNjYWxhYmxlIGRhdGEgY29tcHJlc3Npb24KSW4gdGhpcyBwcm9ibGVtLCB0aGUgZW5jb2RlciBjb25zdHJ1Y3RzIGEgcHJvZ3Jlc3NpdmUgZGVzY3JpcHRpb24sIHN1Y2ggdGhhdCB0aGUgcmVjZWl2ZXIgd2l0aCBoaWdoIHF1YWxpdHkgc2lkZSBpbmZvcm1hdGlvbiB3aWxsIGJlIGFibGUgdG8gdHJ1bmNhdGUgdGhlIGJpdC1zdHJlYW0gYW5kIHJlY29uc3RydWN0IGluIHRoZSByYXRlIGRpc3RvcnRpb24gc2Vuc2UsIHdoaWxlIHRoZSByZWNlaXZlciB3aXRoIGxvdyBxdWFsaXR5CnNpZGUgaW5mb3JtYXRpb24gd2lsbCBoYXZlIHRvIHJlY2VpdmUgZnVydGhlciBkYXRhIGluIG9yZGVyIHRvIGRlY29kZS4gV2UgcHJvdmlkZSBhIGNvbXBsZXRlIGNoYXJhY3Rlcml6YXRpb24gb2YgdGhlCnJhdGUgZGlzdG9ydGlvbiByZWdpb24gZm9yIHRoZSBpbXBvcnRhbnQgcXVhZHJhdGljIEdhdXNzaWFuIGNhc2Ugd2l0aCBtdWx0aXBsZSBqb2ludGx5IEdhdXNzaWFuIHNpZGUtaW5mb3JtYXRpb25zLAp3aGVyZSB0aGUgc2lkZSBpbmZvcm1hdGlvbiBxdWFsaXR5IGRvZXMgbm90IGhhdmUgdG8gYmUgbW9ub3RvbmljIGFsb25nIHRoZSBzY2FsYWJsZSBjb2Rpbmcgb3JkZXIuIElubmVyIGFuZCBvdXRlciBib3VuZHMgYXJlIHByb3ZpZGVkIHRvCnRoZSByYXRlIGRpc3RvcnRpb24gcmVnaW9uIGZvciBnZW5lcmFsIGRpc2NyZXRlIG1lbW9yeWxlc3Mgc291cmNlcy59LAogYXV0aG9yID0ge0MuIFRpYW4gYW5kIFMgTi4gRGlnZ2F2aX0sCiBmaWxlID0gezpwYXBlcnM6c2lzY2FsYWJsZV90aWFuZGlnZ2F2aS5wZGZ9LAogam91cm5hbCA9IHtJRUVFIFRyYW5zYWN0aW9ucyBvbiBJbmZvcm1hdGlvbiBUaGVvcnl9LAogbGFiZWwgPSB7dGRfajA4fSwKIG1vbnRoID0ge0RlY2VtYmVyfSwKIG5vdGUgPSB7fSwKIG51bWJlciA9IHsxMn0sCiBwYWdlcyA9IHs1NTkxLS01NjA4fSwKIHRhZ3MgPSB7am91cm5hbCxSRFNJLE5EQyxTY2FsYWJsZVNJY29kLElUfSwKIHRpdGxlID0ge1NpZGUtaW5mb3JtYXRpb24gc2NhbGFibGUgc291cmNlIGNvZGluZ30sCiB0eXBlID0gezJ9LAogdXJsX2FyeGl2ID0ge2h0dHA6Ly9hcnhpdi5vcmcvYWJzLzA3MDcuNDU5N30sCiB2b2x1bWUgPSB7NTR9LAogeWVhciA9IHsyMDA4fQp9Cgo=\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=label:(td_j08|tcd_j08|td_j07)&amp;jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=label:(td_j08|tcd_j08|td_j07)&amp;jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=label:(td_j08|tcd_j08|td_j07)&amp;jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2008\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2008')\"\n      onkeypress=\"toggleGroup('group_2008')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2008</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"tian-chen-sndiggavi-multiusersuccessiverefinementandmultipledescriptioncoding-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Tian;  J. Chen;  and   S N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/0707.4133\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'tian-chen-sndiggavi-multiusersuccessiverefinementandmultipledescriptioncoding-2008', 'http://arxiv.org/abs/0707.4133', event);\">\n    Multiuser successive refinement and multiple description coding.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 54(2): 921–931. February 2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/0707.4133\"\n     onclick=\"log_download('tian-chen-sndiggavi-multiusersuccessiverefinementandmultipledescriptioncoding-2008', 'http://arxiv.org/abs/0707.4133', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Multiuser successive refinement and multiple description coding [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tian-chen-sndiggavi-multiusersuccessiverefinementandmultipledescriptioncoding-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tian-chen-sndiggavi-multiusersuccessiverefinementandmultipledescriptioncoding-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{TCDj08,\n abstract = {We study the multi-user successive refinement problem (posed in Pradhan and Ramchandran, 2002), where the users are connected to a central server through links with different noiseless capacities. Each user requires to reconstruct the source in a scalable manner. We provide the best known achievable strategy for the two-user, two-layer case and the complete characterization of the rate-distortion region for the Gaussian source under the mean-squared error (MSE) distortion measure.},\n author = {C. Tian and J. Chen and S N. Diggavi,},\n file = {:papers:multiusersr.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {tcd_j08},\n month = {February},\n note = {},\n number = {2},\n pages = {921--931},\n tags = {journal,RDSI,NDC,RDmultiserSucRef,IT,MDC},\n title = {Multiuser successive refinement and multiple description coding},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/0707.4133},\n volume = {54},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study the multi-user successive refinement problem (posed in Pradhan and Ramchandran, 2002), where the users are connected to a central server through links with different noiseless capacities. Each user requires to reconstruct the source in a scalable manner. We provide the best known achievable strategy for the two-user, two-layer case and the complete characterization of the rate-distortion region for the Gaussian source under the mean-squared error (MSE) distortion measure.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"tian-diggavi-sideinformationscalablesourcecoding-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   C. Tian;  and  S N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/0707.4597\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'tian-diggavi-sideinformationscalablesourcecoding-2008', 'http://arxiv.org/abs/0707.4597', event);\">\n    Side-information scalable source coding.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 54(12): 5591–5608. December 2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/0707.4597\"\n     onclick=\"log_download('tian-diggavi-sideinformationscalablesourcecoding-2008', 'http://arxiv.org/abs/0707.4597', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Side-information scalable source coding [link]\"\n       title=\" arxiv\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> arxiv</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/tian-diggavi-sideinformationscalablesourcecoding-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('tian-diggavi-sideinformationscalablesourcecoding-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{TDj08,\n abstract = {We introduce the problem of side-information scalable data compression\nIn this problem, the encoder constructs a progressive description, such that the receiver with high quality side information will be able to truncate the bit-stream and reconstruct in the rate distortion sense, while the receiver with low quality\nside information will have to receive further data in order to decode. We provide a complete characterization of the\nrate distortion region for the important quadratic Gaussian case with multiple jointly Gaussian side-informations,\nwhere the side information quality does not have to be monotonic along the scalable coding order. Inner and outer bounds are provided to\nthe rate distortion region for general discrete memoryless sources.},\n author = {C. Tian and S N. Diggavi},\n file = {:papers:siscalable_tiandiggavi.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {td_j08},\n month = {December},\n note = {},\n number = {12},\n pages = {5591--5608},\n tags = {journal,RDSI,NDC,ScalableSIcod,IT},\n title = {Side-information scalable source coding},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/0707.4597},\n volume = {54},\n year = {2008}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We introduce the problem of side-information scalable data compression In this problem, the encoder constructs a progressive description, such that the receiver with high quality side information will be able to truncate the bit-stream and reconstruct in the rate distortion sense, while the receiver with low quality side information will have to receive further data in order to decode. We provide a complete characterization of the rate distortion region for the important quadratic Gaussian case with multiple jointly Gaussian side-informations, where the side information quality does not have to be monotonic along the scalable coding order. Inner and outer bounds are provided to the rate distortion region for general discrete memoryless sources.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);